Lattice Quantization with Side Information
نویسنده
چکیده
We consider the design of lattice vector quantizers for the problem of coding Gaussian sources with uncoded side information available only at the decoder. The design of such quantizers can be reduced to the problem of nding an appropriate sublattice of a given lattice codebook. We study the performance of the resulting quantizers in the limit as the encoding rate becomes high, and we evaluate these asymptotics for three lattices of interest: the hexagonal lattice A2, the Gosset lattice E8, and the Leech lattice 24. We also verify these asymptotics numerically, via computer simulations based on the lattice A2. Surprisingly, the lattice E8 achieves the best performance of all cases considered.
منابع مشابه
A Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding
Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...
متن کاملPolar Codes and Polar Lattices for the Heegard-Berger Problem
Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for the doubly-symmetric binary sources when the side information may be absent. The nested structure contains two optimal polar codes for lossy source coding and channel c...
متن کاملAnalysis of 1-D Nested Lattice Quantization and Slepian-Wolf Coding for Wyner-Ziv Coding of i.i.d. Sources
Entropy coded scaler quantization (ECSQ) performs 1.53 dB from optimal lossy compression at high data rates. In this paper, we generalize this result for distributed source coding with side information. 1-D nested scaler quantization with Slepian-Wolf coding is compared to Wyner-Ziv coding of i.i.d. Gaussian sources at high data rates. We show that nested scaler quantization with Slepian-Wolf c...
متن کاملMultiple Description Lattice Vector Quantization Multiple Description Lattice Vector Quantization
This thesis studies the multiple description vector quantization with lattice codebooks (MDLVQ). The design of index assignment is crucial to the performance of MDLVQ. However, to our best knowledge, none of previous index assignment algorithms for MDLVQ is optimal. In this thesis, we propose a simple linear-time index assignment algorithm for MDLVQ with any K ≥ 2 balanced descriptions. We prov...
متن کاملAsymptotic Analysis of Multiple Description Lattice Vector Quantization
Recent results have shown that general K-channel multiple-description-coding (MDC) approaches often have significant advantages over conventional twochannel MDC methods. We provide new asymptotic results to describe the performance of a general K-channel symmetric MDC lattice vector quantizer (MDLVQ). We consider a memoryless L-dimensional source with probability density function f and differen...
متن کامل